Zero-Correlation Linear Cryptanalysis of Reduced Round ARIA with Partial-sum and FFT
نویسندگان
چکیده
Block cipher ARIA was first proposed by some South Korean experts in 2003, and later, it was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards. In this paper, we focus on the security evaluation of ARIA block cipher against the recent zero-correlation linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier Transform) technique are used to speed up the cryptanalysis, respectively. We first introduce some 4-round linear approximations of ARIA with zero-correlation, and then present some key-recovery attacks on 6/7-round ARIA-128/256 with Partial-sum technique and FFT technique. The key-recovery attack with Partial-sum technique on 6-round ARIA-128 needs 2 known plaintexts (KPs), 2 encryptions and 2 bytes memory, and the attack with FFT technique requires 2 KPs, 2 encryptions and 2 bytes memory. Moreover, applying Partial-sum technique, we can attack 7-round ARIA-256 with 2 KPs, 2 encryptions and 2 bytes memory and 7-round ARIA-256 employing FFT technique, requires 2 KPs, 2 encryptions and 2 bytes memory. Our results are the first zero-correlation linear cryptanalysis results on ARIA.
منابع مشابه
Improved Integral and Zero-correlation Linear Cryptanalysis of Reduced-round CLEFIA Block Cipher
CLEFIA is a block cipher developed by Sony Corporation in 2007. It is a recommended cipher of CRYPTREC, and has been adopted as ISO/IEC international standard in lightweight cryptography. In this paper, some new 9-round zero-correlation linear distinguishers of CLEFIA are constructed with the input masks and output masks being independent, which allow multiple zero-correlation linear attacks on...
متن کاملImproved Linear Cryptanalysis of Round-Reduced ARIA
ARIA is an iterated SPN block cipher developed by a group of Korean cryptographers in 2003, established as a Korean standard in 2004 and added to the Transport Layer Security (TLS) supported cipher suites in 2011. It encrypts 128-bit blocks with either 128, 192, or 256bit key. In this paper, we revisit the security of round-reduced ARIA against linear cryptanalysis and present a 5-round linear ...
متن کاملZero Correlation Linear Cryptanalysis on LEA Family Ciphers
—In recent two years, zero correlation linear cryptanalysis has shown its great potential in cryptanalysis and it has proven to be effective against massive ciphers. LEA is a block cipher proposed by Deukjo Hong, who is the designer of an ISO standard block cipher HIGHT. This paper evaluates the security level on LEA family ciphers against zero correlation linear cryptanalysis. Firstly, we ide...
متن کاملZero Correlation Linear Cryptanalysis with Reduced Data Complexity
Zero correlation linear cryptanalysis is a novel key recovery technique for block ciphers proposed in [5]. It is based on linear approximations with probability of exactly 1/2 (which corresponds to the zero correlation). Some block ciphers turn out to have multiple linear approximations with correlation zero for each key over a considerable number of rounds. Zero correlation linear cryptanalysi...
متن کاملIntegral and Multidimensional Linear Distinguishers with Correlation Zero
Zero-correlation cryptanalysis uses linear approximations holding with probability exactly 1/2. In this paper, we reveal fundamental links of zero-correlation distinguishers to integral distinguishers and multidimensional linear distinguishers. We show that an integral implies zero-correlation linear approximations and that a zero-correlation linear distinguisher is actually a special case of m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TIIS
دوره 9 شماره
صفحات -
تاریخ انتشار 2015